/*
 * @lc app=leetcode.cn id=1 lang=cpp
 *
 * [1] 两数之和
 */

// @lc code=start
class Solution {
  public:
    vector<int> twoSum(vector<int> &nums, int target) {
        int n = nums.size();
        for (int i = 0; i < n - 1; ++i)
            for (int m = i + 1; m < n; ++m)
                if (nums[i] + nums[m] == target)
                    return {i, m};
        return {};
    }
};
// @lc code=end
